0.06/0.19	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.19	% Command    : run_E %s %d THM
0.11/0.42	% Computer : n006.cluster.edu
0.11/0.42	% Model    : x86_64 x86_64
0.11/0.42	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.42	% Memory   : 8042.1875MB
0.11/0.42	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.42	% CPULimit   : 1440
0.11/0.42	% WCLimit    : 180
0.11/0.42	% DateTime   : Thu Jul  4 09:11:24 EDT 2024
0.11/0.42	% CPUTime    : 
0.27/0.61	Running higher-order theorem proving
0.28/0.64	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.bu8p0PtfXO/E---3.1_9678.p
0.31/0.70	# Version: 3.2.0-ho
0.31/0.70	# Preprocessing class: HSLMSMSSLLLCHSA.
0.31/0.70	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.31/0.70	# Starting lpo1_fix with 540s (3) cores
0.31/0.70	# Starting full_lambda_9 with 180s (1) cores
0.31/0.70	# Starting almost_fo_4 with 180s (1) cores
0.31/0.70	# Starting new_ho_9 with 180s (1) cores
0.31/0.70	# Starting pre_casc_4 with 180s (1) cores
0.31/0.70	# Starting ho_unfolding_6 with 180s (1) cores
0.31/0.70	# pre_casc_4 with pid 9760 completed with status 0
0.31/0.70	# Result found by pre_casc_4
0.31/0.70	# Preprocessing class: HSLMSMSSLLLCHSA.
0.31/0.70	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.31/0.70	# Starting lpo1_fix with 540s (3) cores
0.31/0.70	# Starting full_lambda_9 with 180s (1) cores
0.31/0.70	# Starting almost_fo_4 with 180s (1) cores
0.31/0.70	# Starting new_ho_9 with 180s (1) cores
0.31/0.70	# Starting pre_casc_4 with 180s (1) cores
0.31/0.70	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.31/0.70	# Search class: HGUSM-FFMM31-DHSMMSBN
0.31/0.70	# partial match(3): HGHSM-FFMM31-SHSSMSBN
0.31/0.70	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.31/0.70	# Starting new_ho_10 with 98s (1) cores
0.31/0.70	# new_ho_10 with pid 9762 completed with status 0
0.31/0.70	# Result found by new_ho_10
0.31/0.70	# Preprocessing class: HSLMSMSSLLLCHSA.
0.31/0.70	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.31/0.70	# Starting lpo1_fix with 540s (3) cores
0.31/0.70	# Starting full_lambda_9 with 180s (1) cores
0.31/0.70	# Starting almost_fo_4 with 180s (1) cores
0.31/0.70	# Starting new_ho_9 with 180s (1) cores
0.31/0.70	# Starting pre_casc_4 with 180s (1) cores
0.31/0.70	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.31/0.70	# Search class: HGUSM-FFMM31-DHSMMSBN
0.31/0.70	# partial match(3): HGHSM-FFMM31-SHSSMSBN
0.31/0.70	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.31/0.70	# Starting new_ho_10 with 98s (1) cores
0.31/0.70	# Preprocessing time       : 0.004 s
0.31/0.70	# Presaturation interreduction done
0.31/0.70	
0.31/0.70	# Proof found!
0.31/0.70	# SZS status Theorem
0.31/0.70	# SZS output start CNFRefutation
0.31/0.70	thf(decl_22, type, is_of: $i > ($i > $o) > $o).
0.31/0.70	thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o).
0.31/0.70	thf(decl_25, type, in: $i > $i > $o).
0.31/0.70	thf(decl_77, type, e_is: $i > $i > $i > $o).
0.31/0.70	thf(decl_123, type, nat: $i).
0.31/0.70	thf(decl_124, type, n_is: $i > $i > $o).
0.31/0.70	thf(decl_142, type, n_pl: $i > $i > $i).
0.31/0.70	thf(decl_153, type, esk1_0: $i).
0.31/0.70	thf(decl_154, type, esk2_0: $i).
0.31/0.70	thf(decl_155, type, esk3_0: $i).
0.31/0.70	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.bu8p0PtfXO/E---3.1_9678.p', def_all_of)).
0.31/0.70	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.bu8p0PtfXO/E---3.1_9678.p', def_is_of)).
0.31/0.70	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox/tmp/tmp.bu8p0PtfXO/E---3.1_9678.p', def_e_is)).
0.31/0.70	thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox/tmp/tmp.bu8p0PtfXO/E---3.1_9678.p', def_n_is)).
0.31/0.70	thf(satz19b, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X244:$i]:((in @ X244 @ nat))) @ (^[X245:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:(((n_is @ (n_pl @ X1 @ X4) @ (n_pl @ X245 @ X4))<=(n_is @ X1 @ X245))))))))))), file('/export/starexec/sandbox/tmp/tmp.bu8p0PtfXO/E---3.1_9678.p', satz19b)).
0.31/0.70	thf(c_0_5, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
0.31/0.70	thf(c_0_6, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
0.31/0.70	thf(c_0_7, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
0.31/0.70	thf(c_0_8, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_5, c_0_6])).
0.31/0.70	thf(c_0_9, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_7])).
0.31/0.70	thf(c_0_10, negated_conjecture, ~(![X358:$i]:(((in @ X358 @ nat)=>![X357:$i]:(((in @ X357 @ nat)=>![X356:$i]:(((in @ X356 @ nat)=>(((X358)=(X357))=>((n_pl @ X358 @ X356)=(n_pl @ X357 @ X356)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz19b])]), c_0_8]), c_0_9])])).
0.31/0.70	thf(c_0_11, negated_conjecture, ((in @ esk1_0 @ nat)&((in @ esk2_0 @ nat)&((in @ esk3_0 @ nat)&(((esk1_0)=(esk2_0))&((n_pl @ esk1_0 @ esk3_0)!=(n_pl @ esk2_0 @ esk3_0)))))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])).
0.31/0.70	thf(c_0_12, negated_conjecture, ((n_pl @ esk1_0 @ esk3_0)!=(n_pl @ esk2_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.31/0.70	thf(c_0_13, negated_conjecture, ((esk1_0)=(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.31/0.70	thf(c_0_14, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_13])]), ['proof']).
0.31/0.70	# SZS output end CNFRefutation
0.31/0.70	# Parsed axioms                        : 370
0.31/0.70	# Removed by relevancy pruning/SinE    : 298
0.31/0.70	# Initial clauses                      : 112
0.31/0.70	# Removed in clause preprocessing      : 3
0.31/0.70	# Initial clauses in saturation        : 109
0.31/0.70	# Processed clauses                    : 3
0.31/0.70	# ...of these trivial                  : 0
0.31/0.70	# ...subsumed                          : 0
0.31/0.70	# ...remaining for further processing  : 2
0.31/0.70	# Other redundant clauses eliminated   : 0
0.31/0.70	# Clauses deleted for lack of memory   : 0
0.31/0.70	# Backward-subsumed                    : 0
0.31/0.70	# Backward-rewritten                   : 0
0.31/0.70	# Generated clauses                    : 0
0.31/0.70	# ...of the previous two non-redundant : 0
0.31/0.70	# ...aggressively subsumed             : 0
0.31/0.70	# Contextual simplify-reflections      : 0
0.31/0.70	# Paramodulations                      : 0
0.31/0.70	# Factorizations                       : 0
0.31/0.70	# NegExts                              : 0
0.31/0.70	# Equation resolutions                 : 0
0.31/0.70	# Disequality decompositions           : 0
0.31/0.70	# Total rewrite steps                  : 1
0.31/0.70	# ...of those cached                   : 0
0.31/0.70	# Propositional unsat checks           : 0
0.31/0.70	#    Propositional check models        : 0
0.31/0.70	#    Propositional check unsatisfiable : 0
0.31/0.70	#    Propositional clauses             : 0
0.31/0.70	#    Propositional clauses after purity: 0
0.31/0.70	#    Propositional unsat core size     : 0
0.31/0.70	#    Propositional preprocessing time  : 0.000
0.31/0.70	#    Propositional encoding time       : 0.000
0.31/0.70	#    Propositional solver time         : 0.000
0.31/0.70	#    Success case prop preproc time    : 0.000
0.31/0.70	#    Success case prop encoding time   : 0.000
0.31/0.70	#    Success case prop solver time     : 0.000
0.31/0.70	# Current number of processed clauses  : 2
0.31/0.70	#    Positive orientable unit clauses  : 2
0.31/0.70	#    Positive unorientable unit clauses: 0
0.31/0.70	#    Negative unit clauses             : 0
0.31/0.70	#    Non-unit-clauses                  : 0
0.31/0.70	# Current number of unprocessed clauses: 106
0.31/0.70	# ...number of literals in the above   : 293
0.31/0.70	# Current number of archived formulas  : 0
0.31/0.70	# Current number of archived clauses   : 0
0.31/0.70	# Clause-clause subsumption calls (NU) : 0
0.31/0.70	# Rec. Clause-clause subsumption calls : 0
0.31/0.70	# Non-unit clause-clause subsumptions  : 0
0.31/0.70	# Unit Clause-clause subsumption calls : 0
0.31/0.70	# Rewrite failures with RHS unbound    : 0
0.31/0.70	# BW rewrite match attempts            : 0
0.31/0.70	# BW rewrite match successes           : 0
0.31/0.70	# Condensation attempts                : 3
0.31/0.70	# Condensation successes               : 0
0.31/0.70	# Termbank termtop insertions          : 14422
0.31/0.70	# Search garbage collected termcells   : 5747
0.31/0.70	
0.31/0.70	# -------------------------------------------------
0.31/0.70	# User time                : 0.010 s
0.31/0.70	# System time              : 0.006 s
0.31/0.70	# Total time               : 0.015 s
0.31/0.70	# Maximum resident set size: 3224 pages
0.31/0.70	
0.31/0.70	# -------------------------------------------------
0.31/0.70	# User time                : 0.017 s
0.31/0.70	# System time              : 0.009 s
0.31/0.70	# Total time               : 0.027 s
0.31/0.70	# Maximum resident set size: 2284 pages
0.31/0.70	% E---3.1 exiting
0.31/0.71	% E exiting
0.31/0.71	EOF